A Public Key Cryptosystem Using a Group of Permutation Polynomials
نویسندگان
چکیده
منابع مشابه
Public Key Cryptography Using Permutation P-polynomials over Finite Fields
In this paper we propose an efficient multivariate public key cryptosystem based on permutation p-polynomials over finite fields. We first characterize a class of permutation ppolynomials over finite fields Fqm and then construct a trapdoor function using this class of permutation p-polynomials. The complexity of encryption in our public key cryptosystem is O(m) multiplication which is equivale...
متن کاملNtru: a Public Key Cryptosystem
0. Introduction 1. Description of NTRU 1.1. Notation 1.2. Key Creation 1.3. Encryption 1.4. Decryption 1.5. Why Decryption Works 1.6. Parameter choices notation and a norm estimate 1.7. Sample spaces 1.8. A Decryption Criterion 2. Attributes and Advantages of NTRU 2.1. Theoretical Operating Speci cations 2.2. Comparison With Other PKCS's 3. Security Considerations 3.1. Security Analysis 3.2. Br...
متن کاملPublic key cryptosystem and a key exchange protocol using tools of non-abelian group
Abstract. Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper tria...
متن کاملGroup Authentication Using The Naccache-Stern Public-Key Cryptosystem
A group authentication protocol authenticates pre-defined groups of individuals such that: • No individual is identified • No knowledge of which groups can be successfully authenticated is known to the verifier • No sensitive data is exposed The paper presents a group authentication protocol based on splitting the private keys of the Naccache-Stern public-key cryptosystem in such a way that the...
متن کاملA New Public-Key Cryptosystem
It is striking to observe that two decades after the discovery of public-key cryptography, the cryptographer’s toolbox contains only a dozen of asymmetric encryption schemes. This rarity and the fact that today’s most popular schemes had so far defied all complexity classification a.ttempts strongly motivates the design of new asymmetric cryptosystems. Interestingly, the crypt,ographic communit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tatra Mountains Mathematical Publications
سال: 2020
ISSN: 1210-3195
DOI: 10.2478/tmmp-2020-0013